The Move-to-root Rule for Self-organizing Trees with Markov dependent Requests
نویسنده
چکیده
An exact formula for the move-to-front rule for self-organizing lists.
منابع مشابه
On the Markov chain for the move-to-root rule for binary search trees
The move-to-root (MTR) heuristic is a self-organizing rule which attempts to keep a binary search tree in near-optimal form. It is a tree analogue of the move-to-front (MTF) scheme for self-organizing lists. Both heuristics can be modeled as Markov chains. We show that the MTR chain can be derived by lumping the MTF chain and give exact formulas for the transition probabilities and stationary d...
متن کاملRates of convergence for a self-organizing scheme for binary search trees
The move-to-root heuristic is a self-organizing rule which attempts to keep a binary search tree in near-optimal form. It is a tree analogue of the move-to-front scheme (also known as the weighted random-totop card shuffle or Tsetlin library) for self-organizing lists. We study convergence of the move-to-root Markov chain to its stationary distribution and show that move-to-root converges two t...
متن کاملSelf-Organizing Data Structures with Dependent Accesses
We consider self-organizing data structures in the case where the sequence of accesses can be modeled by a first order Markov chain. For the simple-kand batched-k–move-to-front schemes, explicit formulae for the expected search costs are derived and compared. We use a new approach that employs the technique of expanding a Markov chain. This approach generalizes the results of Gonnet/Munro/Suwan...
متن کاملOptimality of the Move-to-front Heuristic for Self-organizing Data Structures by Philippe Chassaing
In papers about self organizing data structures, it is often mentioned that the assumption of independence of successive requests of keys should be relaxed, and that the dependence assume the form of a locality phenomenon. In this setting, the move-to-front rule is considered to be of interest, but no optimality result concerning this rule has appeared. In this paper we assume that the sequence...
متن کاملDagstuhl Seminar on On-line Algorithms
A Survey of Self-Organizing Data-Structures Susanne Albers and Jeffery Westbrook Self-organizing data structures modify their structure while processing a sequence of operations. The data structure is allowed to be in an arbitrary state, i.e. no global constraint has to be satisfied, but during each operation a simple restructuring rule is applied. The purpose of this restructuring is to guaran...
متن کامل